Longest increasing subsequences in sliding windows

We consider the problem of :nding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in time O(n log log n+OUTPUT) for a sequence of n elements. This data structure substantially improves over the na?@ve generalization of the longest increasing subsequence algorithm and in fact produces an output-sensitive optimal solution. c © 2004 Elsevier B.V. All rights reserved.